A General Framework for Approximating Min Sum Ordering Problems

Approximating Min - sum Set Cover 1 Uriel

Approximating Minimum Linear Ordering Problems

This paper addresses the Minimum Linear Ordering Problem (MLOP): Given a nonnegative set function f on a finite set V , find a linear ordering on V such that the sum of the function values for all the suffixes is minimized. This problem generalizes well-known problems such as the Minimum Linear Arrangement, Min Sum Set Cover, Minimum Latency Set Cover, and Multiple Intents Ranking. Extending a ...

A General Framework for Ordering Fuzzy Sets

Orderings and rankings of fuzzy sets have turned out to play a fundamental role in various disciplines. Throughout the previous 25 years, a lot a different approaches to this issue have been introduced, ranging from rather simple ones to quite exotic ones. The aim of this paper is to present a new framework for comparing fuzzy sets with respect to a general class of fuzzy orderings. This approa...

Approximating Min-Max (Regret) Versions of Some Polynomial Problems

While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies about their approximation. For a bounded number of scenarios, we establish a general approximation scheme which can be used for min-max and min-max regret versions of some polynomial problems. Applying this scheme to short...

A Min-Edge Cost Flow Framework for Capacitated Covering Problems

In this work, we introduce the Cov-MECF framework, a special case of minimum-edge cost flow in which the input graph is bipartite. We observe that several important covering (and multi-covering) problems are captured in this unifying model and introduce a new heuristic LPO for any problem in this framework. The essence of LPO harnesses as an oracle the fractional solution in deciding how to gre...